Argument-based Constraint Logic-Programming in Satisfiability Modulo CHR
نویسنده
چکیده
We revise classical results in Argumentation-based Logic Programming, e.g., Defeasible Logic Programming (DeLP), under the umbrella of Satisfiability Modulo CHR. Through this language it is possible to reason on arguments and have an underlying theory solver to implement resolution of conflicts. Strict and defeasible rules, as well as certainty scores associated with such rules (e.g., Possibilistic DeLP), can be cast to SMCHR rules, which act as conflict “disentanglers”. At the same time, we inherit several built-in theory solvers, as unification or linear arithmetic, usable even in combination. SMCHR can be used also to straightforwardly solve Argumentation based on Classical Logic, by selecting a sat solver.
منابع مشابه
SMCHR: Satisfiability modulo constraint handling rules
Constraint Handling Rules (CHRs) are a high-level rule-based programming language for specification and implementation of constraint solvers. CHR manipulates a global store representing a flat conjunction of constraints. By default, CHR does not support goals with a more complex propositional structure including disjunction, negation, etc., or CHR relies on the host system to provide such featu...
متن کاملSatisfiability Modulo Constraint Handling Rules (Extended Abstract)
Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm ...
متن کاملIntegrating Mixed-Integer Optimisation and Satisfiability Modulo Theories: Application to Scheduling
One way to address multi-scale optimisation problems is by integrating logic and optimisation. For example, a scheduling problem may have two levels: (i) assigning orders to machines and (ii) sequencing orders on each machine. In a minumum cost model, assigning orders to machines is a mixed-integer optimisation problem, sequencing orders is a constraint satisfaction problem. The entire problem ...
متن کاملCLP Entailment as Lazy Clause Generation
In this paper we present an algorithm for deciding entailment G |= H of properties G and H defined using Constraint Logic Programming (CLP). The algorithm is based on Satisfiability Modulo Theories (SMT) over a theory derived from the CLP program. The implementation is based on lazy clause generation. Existing methods for discharging such entailments rely on applying a set of proof rules (such ...
متن کامل